Covering Linear Programming with Violations
نویسندگان
چکیده
منابع مشابه
Covering Linear Programming with Violations
We consider a class of linear programs involving a set of covering constraints of which at most k are allowed to be violated. We show that this covering linear program with violation is strongly NP-hard. In order to improve the performance of mixed-integer programming (MIP) based schemes for these problems, we introduce and analyze a coefficient strengthening scheme, adapt and analyze an existi...
متن کاملLow-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in 2 and 3 dimensions (and subsequently, any constant number of dimensions) can be solved in linear time. In this paper, we consider linear programming with at most k violations: finding a point inside all but at most k of n given halfspaces. We give a simple algorithm in 2-d that runs in O((n + k2) logn) expected time; this is fa...
متن کاملThe Linear Programming Set Covering Machine
The Set Covering Machine (SCM) was introduced by Marchand & Shawe–Taylor [6, 7] in which a minimum set cover of a class of examples was approximated to find a compact conjunction/disjunction of features for classification. Their approach was to solve the set cover problem using the greedy algorithm. In this paper we introduce an alternative method of solving the SCM by formulating it as a Linea...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2014
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2013.0582